منابع مشابه
On Scheduling Two-Stage Jobs on Multiple Two-Stage Flowshops
Motivated by the current research in data centers and cloud computing, we study the problem of scheduling a set of two-stage jobs on multiple two-stage flowshops. A new formulation for configurations of such scheduling is proposed, which leads directly to improvements to the complexity of scheduling algorithms for the problem. Motivated by the observation that the costs of the two stages can be...
متن کاملA Heuristic Method on Extended Two-Stage Network Structures
Data Envelopment Analysis (DEA) as a non–parametric method is used to measure relative performance of organizational units. The aim of this paper is to develop a new model to evaluate the efficiency of a general two-stage network structures proposed by Li et al. (2012) for measuring the performance of Decision Making Units (DMUs). In addition, this paper expands the work of Li et al. (2012) an...
متن کاملTwo-stage network DEA-R based on value efficiency
It is essential for most organizations and financial institutes to be able to evaluate their decision-making units (DMUs), when there is only a ratio of inputs to outputs (or vice versa) available. In this paper, we will propose our two-stage DEA-R models, which are a combination of data envelopment analysis and ratio data, based on value efficiency. Integrating value efficiency into data envel...
متن کاملUndetectable On{line Password Guessing Attacks Undetectable On-line Password Guessing Attacks
Limited distribution notes: This report has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher its distribution outside the University of Technology Chemnitz-Zwickau prior to publication should be limited to peer communications and speciic requests. After outside publication, requests should be lled only by rep...
متن کاملGuessing and non-guessing of canonical functions
It is possible to control to a large extent, via semiproper forcing, the parameters (β0, β1) measuring the guessing density of the members of any given antichain of stationary subsets of ω1 (assuming the existence of an inaccessible limit of measurable cardinals). Here, given a pair (β0, β1) of ordinals, we will say that a stationary set S ⊆ ω1 has guessing density (β0, β1) if β0 = γ(S) and β1 ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information
سال: 2021
ISSN: 2078-2489
DOI: 10.3390/info12040159